public class Text {
    //合并两个有序链表
    public void merge(int A[], int m, int B[], int n) {
        int i=m-1;
        int j=n-1;
        int k=m+n-1;
        while(i >= 0 && j >= 0){
            if(A[i]>B[j]){
                A[k]=A[i];
                i--;
                k--;
            }else{
                A[k]=B[j];
                j--;
                k--;
            }
        }
        while(j>=0){
            A[k]=B[j];
            j--;
            k--;
        }
    }
    public static void main(String[] args) {
        /*String str="dBowNgxyPZXZXlBTMKFskExQEK";
        int[] arr = new int[129];
        StringBuilder s = new StringBuilder();
        for(int i=0;i<str.length();i++){
            char ch = str.charAt(i);
            if(arr[ch]==0){
                arr[ch]=1;
                s.append(ch);
            }


        }
        String ret=s.toString();
        System.out.println(ret);

         */
    }
    //合并两个有序链表
    /*public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        if(list1 == null){
            return list2;
        }
        if(list2 == null){
            return list1;
        }
        if(list1 == null && list2 == null){
            return null;
        }
        ListNode cur1=list1;
        ListNode cur2=list2;
        ListNode head=new ListNode();
        ListNode cur=head;
        while(cur1 != null && cur2 != null){
            if(cur1.val >= cur2 .val){
                cur.next=cur2;
                cur2=cur2.next;
                cur=cur.next;
            }else{
                cur.next=cur1;
                cur1=cur1.next;
                cur=cur.next;
            }
        }
        if(cur1 != null){
            cur.next=cur1;
        }
        if(cur2 != null){
            cur.next=cur2;
        }
        return head.next;
    }*/
}
